Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing

نویسندگان

  • Pawel Wocjan
  • Dominik Janzing
  • Thomas Beth
چکیده

We construct a nearest-neighbor Hamiltonian whose ground states encode the solutions to the NP-complete problem INDEPENDENT SET in cubic planar graphs. The Hamiltonian can be easily simulated by Ising interactions between adjacent particles on a 2D rectangular lattice. We describe the required pulse sequences. Our methods could help to implement adiabatic quantum computing by “physically reasonable” Hamiltonians like short-range interactions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

We show that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph G can be solved using an adiabatic quantum computer that implements an Ising spin-1/2 Hamiltonian, by reduction through minor-embedding of G in the quantum hardware graph U . There are two components to this reduction: embedding and parameter setting. The embedding problem is to find a minor-embedding...

متن کامل

High order perturbation study of the frustrated quantum Ising chain

In this paper, using high order perturbative series expansion method, the critical exponents of the order parameter and susceptibility in transition from ferromagnetic to disordered phases for 1D quantum Ising model in transverse field, with ferromagnetic nearest neighbor and anti-ferromagnetic next to nearest neighbor interactions, are calculated. It is found that for small value of the frustr...

متن کامل

Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems

The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [6]) has flexible parameters. We show that by choosing the parameters appropriately in the problem Hamiltonian (without changing the problem to be solved) for MIS on CK graphs [7], we can prevent the first order quan...

متن کامل

Scalable Superconducting Architecture for Adiabatic Quantum Computation

Adiabatic quantum computation (AQC) is an approach to universal quantum computation in which the entire computation is performed in the ground state of a suitably chosen Hamiltonian [1]. As such, AQC offers intrinsic protection against dephasing and dissipation [2,3]. Moreover, AQC naturally suggests a novel quantum approach to the classically intractable constrained minimization problems of th...

متن کامل

Avoid First Order Quantum Phase Transition by Changing Problem Hamiltonians

In Amin and Choi [1], we show that an adiabatic quantum algorithm for the NP-hard maximum independent set (MIS) problem on a set of special family of graphs in which there are exponentially many local maxima would have the exponentially small minimum spectral gap and thus would require the exponential time, due to the first order quantum phase transition (FQPT). The problem Hamiltonian of the a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Quantum Information Processing

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2003